Voronoi Hierarchies
نویسندگان
چکیده
Voronoi diagrams are widely used to represent geographical distributions of information, but they are not readily stacked in a hierarchical fashion. We propose a simple mechanism whereby each index Voronoi cell contains the generators of several Voronoi cells in the next lower level. This allows various processes of indexing, paging, visualization and generalization to be performed on various types of data. While one-level Voronoi indexes have been used before, and hierarchies of the dual Delaunay triangulation have been used for fast point location, we believe that this is the first time that the advantages of their integration have been demonstrated.
منابع مشابه
Computing Voronoi Treemaps: Faster, Simpler, and Resolution-independent
Voronoi treemaps represent hierarchies as nested polygons. We here show that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low-resolution approximations, even when the latter are implemented on graphics hardware. More precisely, we propose an instantiation of Lloyd’s method for cent...
متن کاملTerrain Modeling using Voronoi Hierarchies
We present a new algorithm for terrain modeling based on Voronoi diagrams and Sibson’s interpolant. Starting with a set of scattered data sites in the plane with associated function values defining a height field, our algorithm constructs a top-down hierarchy of smooth approximations. We use the convex hull of given sites as domain for our hierarchical representation. Sibson’s interpolant is us...
متن کاملMulti-objective shape segmentation and labeling
Shape segmentations designed for different applications show significant variation in the composition of their parts. In this paper, we introduce the segmentation and labeling of shape based on the simultaneous optimization of multiple heterogenous objectives that capture application-specific segmentation criteria. We present a number of efficient objective functions that capture useful shape a...
متن کاملCapacity-Constrained Voronoi Tessellations: Computation and Applications
Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that each region in a Voronoi tessellation must have t...
متن کاملOn the facility location problem: One-round weighted Voronoi game
Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...
متن کامل